Structure connectivity and substructure connectivity of twisted hypercubes

Eccentric Connectivity and Augmented Eccentric Connectivity Indices of N-Branched Phenylacetylenes Nanostar Dendrimers

Connectivity of Locally Exchanged Twisted Cubes∗

Connectivity κ(G) of a graph G is the minimum number of vertices whose removal leaves the remaining graph disconnected or trivial. This parameter is important for interconnection networks and can be used to measure reliability in such networks. In this paper, a new interconnection network called locally exchanged twisted cube (LETQ for short), denoted LeTQ(s, t), is proposed. We obtain some bas...

eccentric connectivity and augmented eccentric connectivity indices of n-branched phenylacetylenes nanostar dendrimers

Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes

In this paper, we analyze a hypercube-like structure, called the folded hypercube, which is basically a standard hypercube with some extra links established between its nodes. We first show that the n-dimensional folded hypercube is bipartite when n is odd.We also show that the n-dimensional folded hypercube is strongly Hamiltonian-laceable when n is odd, and is Hamiltonian-connected when n = 1...

Connectivity Structure of Systems

In this paper, we consider to what degree the structure of a linear system is determined by the system’s input/output behavior. The structure of a linear system is a directed graph where the vertices represent the variables in the system and an edge (x, y) exists if x directly influences y. In a number of studies, researchers have attempted to identify such structures using input/output data. T...